Nested Intervals Tree Encoding with Continued Fractions
نویسنده
چکیده
Tree encodings methods themselves can be split into 2 groups: • Materialized Path • Nested Sets Materialized Path is nearly ubiquitous encoding, where each tree node is labeled with the path from the node to the root. UNIX global filenames is well known showcase for this idea. Materialized path could be either represented as character string of unique sibling identifiers (concatenated with some separator), or enveloped into user defined type (Roy [2003]).
منابع مشابه
A Multifractal Analysis for Stern-brocot Intervals, Continued Fractions and Diophantine Growth Rates
In this paper we obtain multifractal generalizations of classical results by Lévy and Khintchin in metrical Diophantine approximations and measure theory of continued fractions. We give a complete multifractal analysis for Stern–Brocot intervals, for continued fractions and for certain Diophantine growth rates. In particular, we give detailed discussions of two multifractal spectra closely rela...
متن کاملUsing rational numbers to key nested sets
This report details the generation and use of tree node ordering keys in a single relational database table. The keys for each node are calculated from the keys of its parent, in such a way that the sort order places every node in the tree before all of its descendants and after all siblings having a lower index. The calculation from parent keys to child keys is simple, and reversible in the se...
متن کاملContinued Fractions and Catalan Problems
We find a generating function expressed as a continued fraction that enumerates ordered trees by the number of vertices at different levels. Several Catalan problems are mapped to an ordered-tree problem and their generating functions also expressed as a continued fraction. Among these problems is the enumeration of (132)-pattern avoiding permutations that have a given number of increasing patt...
متن کاملcontinued fraction ∗
We use a continued fraction expansion of the sign-function in order to obtain a five dimensional formulation of the overlap lattice Dirac operator. Within this formulation the inverse of the overlap operator can be calculated by a single Krylov space method where nested conjugate gradient procedures are avoided. We show that the five dimensional linear system can be made well conditioned using ...
متن کاملSturmian Words, Lyndon Words and Trees
We prove some new combinatorial properties of the set PER of all words w having two periods p and q which are coprimes and such that w = p + q 2 [4,3]. We show that aPERb U {a, b} = St n Lynd, where St is the set of the finite factors of all infinite Sturmian words and Lynd is the set of the Lyndon words on the alphabet {a, b}. It is also shown that aPERb U {a, b} = CP, where CP is the set of C...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره cs.DB/0402051 شماره
صفحات -
تاریخ انتشار 2004